#include <bits/stdc++.h>
using namespace std;
int n,r[100005],pre[100005],maxx=-1;
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++){
		cin>>r[i];
		pre[r[i]]++;
	}
	sort(r+1,r+n+1);
	for(int i=r[1];i<=r[n];i++){
		if(pre[i]>=maxx){
			maxx=pre[i];
		}
	}
	cout<<maxx;
    return 0;
}
